A Greedy Algorithm Estimating the Height of Random Trees
نویسندگان
چکیده
منابع مشابه
A Greedy Algorithm Estimating the Height of Random Trees
The behaviour of a greedy algorithm which estimates the height of a random labelled rooted tree is studied. A self-similarity argument is used to characterize the limit distribution of the length H of the path found by such an algorithm in a random rooted tree as the unique solution of an integral equation. Furthermore, it is shown that lim n!1 E H p n = p 2 2 p 2 ln(3 + 2 p 2) = 2 : 353139::: ...
متن کاملProfile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کاملThe height of random binary unlabelled trees
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size n is proved to have a limiting theta distribution, both in a central and local sense. Moderate as well as large deviations estimates are also derived. The proofs rely on the analysis (in the complex plane) of generating fun...
متن کاملEstimating Height and Diameter Growth of Some Street Trees in Urban Green Spaces
Estimating urban trees growth, especially tree height is very important in urban landscape management. The aim of the study was to predict of tree height base on tree diameter. To achieve this goal, 921 trees from five species were measured in five areas of Mashhad city in 2014. The evaluated trees were ash tree (Fraxinus species), plane tree (Platanus hybrida), white mulberry (Morus alba), ail...
متن کاملThe Height and Size of Random Hash Trees and Random Pebbled Hash Trees
The random hash tree and the N-tree were introduced by Ehrlich in 1981. In the random hash tree, n data points are hashed to values X1, . . . , Xn, independently and identically distributed random variables taking values that are uniformly distributed on [0, 1]. Place the Xi’s in n equal-sized buckets as in hashing with chaining. For each bucket with at least two points, repeat the same process...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 1998
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480193258960